FLUID APPROXIMATIONS AND STABILITY OF MULTICLASS QUEUEING NETWORKS: WORK-CONSERVING DISCIPLINES Running Head: Multiclass Queueing Networks
نویسنده
چکیده
This paper studies the uid approximation (also known as the functional strong law-of-large-numbers) and the stability (positive Harris recurrent) for a multiclass queueing network. Both of these are related to the stabilities of a linear uid model, constructed from the rst-order parameters (i.e., long-run average arrivals, services and routings) of the queueing network. It is proved that the uid approximation for the queueing network exists if the corresponding linear uid model is weakly stable, and that the queueing network is stable if the corresponding linear uid model is (strongly) stable. Suucient conditions are found for the stabilities of a linear uid model.
منابع مشابه
Existence Condition for the Diffusion Approximations of Multiclass Priority Queueing Networks
In this paper, we extend the work of Chen and Zhang (2000b) and establish a new sufficient condition for the existence of the (conventional) diffusion approximation for multiclass queueing networks under priority service disciplines. This sufficient condition relates to the weak stability of the fluid networks and the stability of the high priority classes of the fluid networks that correspond ...
متن کاملValidity of Heavy-Traffic Steady-State Approximations in Multiclass Queueing Networks: The Case of Queue-Ratio Disciplines
A class of stochastic processes known as semi-martingale reflecting Brownian motions (SRBMs) is often used to approximate the dynamics of heavily loaded queueing networks. In two influential papers, Bramson (1998) and Williams (1998) laid out a general and structured approach for proving the validity of such heavy-traffic approximations, in which an SRBM is obtained as a diffusion limit from a ...
متن کاملOn Stochastic Processing Networks∗
Stochastic processing networks arise as models in manufacturing, telecommunications, computer systems and the service industry. Common characteristics of these networks are that they have entities, such as jobs, customers or packets, that move along routes, wait in buffers, receive processing from various resources, and are subject to the effects of stochastic variability through such quantitie...
متن کاملFluid models of integrated traffic and multipath routing
In this paper we consider a stochastic model describing the varying number of flows in a network. This model features flows of two types, namely file transfers (with fixed volume) and streaming traffic (with fixed duration), and extends the model of Key, Massoulié, Bain and Kelly [27] by allowing more general bandwidth allocation criteria. We analyse the dynamics of the system under a fluid sca...
متن کاملStability and weakly convergent approximations of queueing systems on a circle
We rst consider a `non-greedy' queueing system on a circle. We present a new and very simple proof of the stability of this system (under the appropriate condition) based on the average travel times between customers. Next we show that the same non-greedy system, with a restricted number of customers, converges weakly to this system when the restricted number goes to innnity. Finally we conside...
متن کامل